Network security apparatus and method of detecting malicious behavior in computer networks via cost-sensitive and connectivity constrained classification

ABSTRACT

A network security apparatus includes a packet detector detecting transmission of data packets between a plurality of hosts and a plurality of domains and defining a plurality of links therefrom. A model builder circuit receives the plurality of links from the packet detector, receives ground truth information labeling one or more of the plurality of hosts or one or more of the plurality of domains as benign or malicious, generates predictive models from the received links and ground truth information, and stores generated predictive models in a predictive model database. An anomaly detector circuit retrieves the generated predictive models from the predictive model database and uses the predictive models to label each of the plurality of hosts and plurality of domains, that have not previously been labeled by the ground truth information, as benign or malicious.

GOVERNMENT LICENSE RIGHTS STATEMENT

This invention was made with Government support under Contract No.: H98230-14-D-0038 awarded by the Department of Defense. The Government has certain rights in this invention.

BACKGROUND 1. Technical Field

The present disclosure relates to a network security apparatus and, more specifically, to a method for detecting malicious behavior in computer networks via cost-sensitive and connectivity constrained classifications, and a network security apparatus making use of the same.

2. Discussion of Related Art

Every day, a large number of malicious attacks result in causing costly damage to large-scale computer networks. Accordingly, cybersecurity has been brought to the attention of researchers, enterprises, and government. One of the ways in which cybersecurity experts have been able to mitigate the damage associated with malicious attacks is by monitoring computer network data to determine when the security of one or more devices on the network has been compromised. For example, enterprises may analyze the flow of network traffic at core routers, Domain Name System (DNS) traffic at DNS servers, HyperText Transfer Protocol (HTTP) traffic through gateways or firewalls, Dynamic Host Configuration Protocol (DHCP) traffic at the DHCP server, and so on. However, due to the limited amount of ground truth and the issue of imbalanced label distributions, it is challenging to automatically detect malicious behavior and abnormal network activity.

BRIEF SUMMARY

A network security apparatus includes a packet detector detecting transmission of data packets between a plurality of hosts and a plurality of domains and defining a plurality of links therefrom. A model builder circuit receives the plurality of links from the packet detector, receives ground truth information labeling one or more of the plurality of hosts or one or more of the plurality of domains as benign or malicious, generates predictive models from the received links and ground truth information, and stores generated predictive models in a predictive model database. An anomaly detector circuit retrieves the generated predictive models from the predictive model database and uses the predictive models to label each of the plurality of hosts and plurality of domains, that have not previously been labeled by the ground truth information, as benign or malicious.

The network security apparatus may be a packet router. The network security apparatus may be a firewall. The predictive model may be generated, by the model builder circuit, by constructing a bipartite graph in which each of the plurality of hosts are represented as nodes on one side of the graph, each of the plurality of domains are represented as nodes on an opposite side of the graph, and each of the plurality of links are represented as edges connecting nodes on opposite sides of the graph.

An edge weight of each of the edges may be determined by either a number of links between a given host and a given domain or an amount of data transferred between the given host and the given domain. The predictive model may be generated, by the model builder circuit, by extracting features from each of the nodes of the graph and determining which of the extracted features are highly correlated to positive labels. A node that is linked to a node with a positive label may have an increased probability of being positively labeled.

The packet detector may be a router that forwards packets between the plurality of hoists and the plurality of domains. When the anomaly detector circuit labels one of the plurality of hosts or plurality of domains, that have not previously been labeled by the ground truth information, as malicious, the router may block traffic to and from the malicious-labeled host or domain.

A method for detecting malicious behavior in a computer network includes receiving packet transmission information including a plurality of data links between a plurality of hosts and a plurality of domains. A bipartite graph is constructed in which each of the plurality of hosts are represented as nodes on one side of the graph, each of the plurality of domains are represented as nodes on an opposite side of the graph, and each of the plurality of links are represented as edges connecting nodes on opposite sides of the graph. One or more of the nodes of the bipartite graph are labeled as benign or malicious according to ground truth information. A cost matrix is defined for misclassification penalty in which a misclassification penalty for labeling a benign node as malicious is less than a misclassification penalty for labeling a malicious node as benign. Supervised models or classifiers are constructed based on the nodes of the bipartite graph labeled according to ground truth information, the plurality of links, and the designed cost matrix. Each of the plurality of hosts and each of the plurality of domains, that have not previously been labeled by the ground truth information, are labeled as benign or malicious according to the constructed supervised models or classifiers.

At least a first of the constructed supervised models or classifiers may be responsible for labeling nodes and at least a second of the constructed supervised models or classifiers may be responsible for labeling domains.

An edge weight of each of the edges may be determined by either a number of links between a given host and a given domain or an amount of data transferred between the given host and the given domain.

The supervised models or classifiers may be constructed by extracting features from each of the nodes of the graph and determining which of the extracted features are highly correlated to malicious labels.

When one of the plurality of hosts or plurality of domains, that have not previously been labeled by the ground truth information, is labeled as malicious, according to the constructed supervised models or classifiers, an alert may be transmitted to a network administrator.

When one of the plurality of hosts or plurality of domains, that have not previously been labeled by the ground truth information, is labeled as malicious, according to the constructed supervised models or classifiers, traffic to and from the malicious-labeled host or domain may be blocked.

A method for detecting malicious behavior in a computer network includes receiving packet transmission information including a plurality of data links between a plurality of hosts and a plurality of domains. A bipartite graph is constructed in which each of the plurality of hosts are represented as nodes on one side of the graph, each of the plurality of domains are represented as nodes on an opposite side of the graph, and each of the plurality of links are represented as edges connecting nodes on opposite sides of the graph. One or more of the nodes of the bipartite graph are labeled as benign or malicious according to ground truth information. The labeling of the one or more nodes of the bipartite graph that have been labeled as benign or malicious are propagated along the plurality of links.

Propagating the labeling of the one or more nodes of the bipartite graph that have been labeled as benign or malicious along the plurality of links may include constructing supervised models or classifiers based on the nodes of the bipartite graph labeled according to ground truth information and the plurality of links. A node that is linked to a node with a positive label may have an increased probability of being positively labeled.

Constructing supervised models or classifiers may further include designing a cost matrix for misclassification penalty in which a misclassification penalty for labeling a benign node as malicious is less than a misclassification penalty for labeling a malicious node as benign.

The supervised models or classifiers may be constructed by extracting features from each of the nodes of the graph and determining which of the extracted features are highly correlated to malicious labels. When a malicious label is propagated, an alert may be generated.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

A more complete appreciation of the present disclosure and many of the attendant aspects thereof will be readily obtained as the same becomes better understood by reference to the following detailed description when considered in connection with the accompanying drawings, wherein:

FIG. 1 is a schematic diagram illustrating an apparatus for performing network anomaly detection in accordance with exemplary embodiments of the present invention;

FIG. 2 is a schematic view of a network apparatus, such as a network router, in accordance with exemplary embodiments of the present invention;

FIG. 3 is an exemplary, simplified bipartite graph representing a bipartite graph that may be used to perform anomaly detection in accordance with exemplary embodiments of the present invention;

FIG. 4 is a flow chart illustrating an approach for detecting malicious behavior in computer networks in accordance with exemplary embodiments of the present invention; and

FIG. 5 shows an example of a computer system capable of implementing the method and apparatus according to embodiments of the present disclosure.

DETAILED DESCRIPTION

In describing exemplary embodiments of the present disclosure illustrated in the drawings, specific terminology is employed for sake of clarity. However, the present disclosure is not intended to be limited to the specific terminology so selected, and it is to be understood that each specific element includes all technical equivalents which operate in a similar manner.

Exemplary embodiments of the present invention seek to mitigate damage associated with malicious attack by analyzing network traffic to identify relationships between hosts, which may be computerized devices connected to a computer network, such as desktop computers, laptop computers, mobile devices, and other connected devices, and domains, which may be content that is hosted and made available over the computer network at a particular address (e.g. URL), such as websites, web services, and the like.

Cybersecurity may be provided by accurately determining whether each host and each domain is malicious or benign (i.e., negative or positive labels). To do this, classifiers may be trained, or classification algorithms designed, to label hosts and domains. Traditionally, separate classifiers have been used to label hosts and domains. For example, host classifiers are trained based on malicious and benign host data while domain classifiers are trained based on malicious and benign domain data.

However, the performance of these separately trained classifiers may not be good when ground truth is limited. For example, when there is insufficient training data available to show what all forms of malicious hosts/domains may look like. To overcome this challenge, exemplary embodiments of the present invention consider the relationships between the hosts and domains. Exemplary embodiments of the present invention exploit the understanding that hosts which visit malicious URLs more frequently are more likely to be malicious, and URLs that are visited more frequently by malicious hosts are more likely to be malicious. Accordingly, exemplary embodiments of the present invention provide approaches that analyze links (e.g. the passing of data between the hosts and domains) to more accurately label both hosts and domains.

Moreover, the issue of imbalanced label distributions is commonly observed in real computer networks, where there are far fewer malicious hosts/domains (i.e., positive labels) than benign ones (i.e., negative labels). Often, in training classifiers for the labeling of either hosts or domains, an equal cost is used for both false positives (labeling a benign host/domain as malicious) and false negatives (labeling a malicious host/domain as benign). As a result, conventionally trained classifiers may tend to label a very high number of objects as negative/benign to achieve high accuracy, as most objects are likely to be negative/benign. However, as the results caused by false negative is more serious as compared to that of false positive, exemplary embodiments of the present invention incorporate distinct misclassification costs for false positive and false negative in the classification model. The misclassification costs, in accordance with exemplary embodiments of the present invention, may be formulated as an optimization problem in which the goal is to find an optimal model that minimizes the total cost, for example, defined as the misclassification costs multiplied by the misclassification errors which may be measured by the Hamming distance between the predicted and true labels over all available samples.

Accordingly, exemplary embodiments of the present invention train cost-sensitive models for labeling hosts and domains, by considering the links between the hosts and domains. For example, a bipartite connectivity graph consisting of network hosts and external domains may be used. A small set of domains' labels (limited ground truth) may then be used to propagate labels across hosts and domains via their links. During the propagation, exemplary embodiments of the present invention may consider behavioral features of the hosts computed from the network data as well as lexical and reputational features computed for the external domains. The predicted labels may be modeled, the misclassification errors may be measured by the Hamming distance between the predicted and true labels, different costs may be incorporated for different misclassification types (i.e., false negative or false positive), and constrain connected nodes may have the same labels in high probability. An optimization task is then formulated. As the Hamming distance function is non-differentiable, exemplary embodiments of the present invention may introduce a continuous loss function to approximate the Hamming distance with performance guaranteed. An effective algorithm with good convergence property may be provided via Stochastic Gradient Descent technique.

Accordingly, exemplary embodiments of the present invention utilize a framework that may be referred to herein as, “Connectivity Constrained Logistic Regression” (CCLR) to incorporate the links between hosts and domains to detect malicious behavior in computer networks and to overcome challenges associated with limited ground truths. The CCLR may be formulated as an optimization problem, incorporating different costs for false positive and false negative misclassification errors. A continuous loss function may be used to approximate the Hamming distance function that is nondifferentiable, and to develop the corresponding solution via Stochastic Gradient Descent technique. Furthermore, the convergence may be analyzed.

FIG. 1 is a schematic diagram illustrating an apparatus for performing network anomaly detection in accordance with exemplary embodiments of the present invention. Network anomaly detection, in accordance with exemplary embodiments of the present invention, may be performed either with respect to a computer network 110 that includes a plurality of computer hosts 111, 112, 113, and 114 or may be performed with respect to an internet service provider (ISP) 130 that includes one or more domains 131, 132, 133, and 134. The apparatus may be embodied as a network router, a firewall device, or a packet sniffing device. For example, the apparatus may be embodied as a router 115 disposed within the computer network 110 or a firewall device 135 disposed by the ISP 130 for the protection of the one or more domains 131-134.

In either event, a network device 115 such as a router, disposed within the computer network 110 may be responsible for routing or analyzing data packets that enter and leave the computer network 110 via the Internet 120. The network device may keep track of data transactions between the hosts 111-114 of the computer network 110 and various domains, such as the domains 131-134 of the ISP 130 by either analyzing the packets that pass therethrough, or as part of its ordinary function as networking hardware. However, from the point of view of maintaining the cybersecurity of the computer network 110, it need not matter that the domains in communication with the hosts are part of the same ISP.

In this way, the network apparatus 115 may keep track of links between its hosts 111-114 and various domains such as domains 131-134 to assure the cybersecurity of the computer network 110. Similarly, the network apparatus 135 that is disposed by the ISP 130 may assure the cybersecurity of its domains 131-134 by examining packets that pass therethrough to make a note of links between its domains 131-134 and the various hosts that are in contact therewith. However, from the point of view of maintaining the cybersecurity of the ISP 130, it need not matter that the hosts in communication with the domains are part of the same computer network.

In this way, the network apparatuses 115 and 135 may be in a position to monitor all host/domain links, for example, to count a number of links, to count a number of packets, and/or to count an amount of data that is communicated across the various links.

FIG. 2 is a schematic view of a network apparatus, such as a network router, in accordance with exemplary embodiments of the present invention. The network apparatus/router 200 may include a packet forwarding/routing device 210, which may be analogous to a conventional network router, as it is responsible for receiving packets from within the computer network and routing them to the linked domains and receiving packets from the linked domains and routing them to the to the hosts within the computer network. The network apparatus/router 200 may also make a record of the various links and pass this link record to a model builder/trainer circuit 220. The model builder/trainer circuit 220 may receive the link record, and various ground truths from an external source, and may use this data to generate predictive models for labeling hosts and domains as positive/negative. The predictive models, which may include one or more models for labeling hosts and one or more models for labeling domains, may be stored in a predictive model database 240.

An anomaly detector circuit 230 may then use the stored predictive models of the predictive model database 240 to label each of the hosts and domains and to generate an alert when a host or domain has been labeled as positive/malicious. According to one exemplary embodiment of the present invention, when a host or domain has been labeled positive/malicious, the anomaly detector circuit 230 may instruct the packet forwarder 210 to stop routing packets to and from the positive-labeled host/domain. This remedial action may, however, be reserved for cases in which a confidence level associated with the positive labeling exceeds a predetermined threshold.

It is to be understood, however, that the model builder 220 may be external to the network apparatus/router 200 and the network apparatus/router 200 may receive the predictive models from an external source and then store the so-received predictive models in the predictive model database 240 for use by the anomaly detector circuit 230.

As described above, exemplary embodiments of the present invention may perform anomaly detection by constructing a bipartite graph in which nodes represent hosts on one side and domains on the other, and edges connecting the host nodes with the domain nodes represent links, which may be defined as the communication of data between domain and host. FIG. 3 is an exemplary, simplified bipartite graph representing a bipartite graph that may be used to perform anomaly detection in accordance with exemplary embodiments of the present invention.

As can be seen from the bipartite graph of FIG. 3, there are four nodes representing four hosts on the left side of the graph: H-1, H-2, H-3, and H-4. There are also three nodes representing three domains in the right side of the graph: D-1, D-2, and D-3. If used from the perspective of a host computer network, all four of the hosts may be within a single network while the domains may be of various ISPs. However, if used from the perspective of an ISP, all three of the domains may be of a single ISP while the hosts may be of various computer networks.

Some limited ground truth may be available, and here, that ground truth data indicates host H-2 is positive/malicious (“bad”) and that domain D-1 is negative/benign (“good”), but no additional ground truth information might be available. In training the classifiers/predictive models, various features may be determined or received for each node (including both hosts and domains). For example, n host features may include: h-1, h-2, h-3, . . . , h-n and m domain features may include d-1, d-2, d-3, . . . , d-m.

The edges that connect hosts with domains may be weighted, for example, edge weight may represent number of links, frequency of links, amount of data exchanged, etc. As will be described in detail below, a cost matrix may be designed for misclassifications in which under-inclusion (false negative) is penalized more greatly than over-inclusion (false positive). Then, features may be extracted, using the graph, and supervised models/classifiers may be built.

FIG. 4 is a flow chart illustrating an approach for detecting malicious behavior in computer networks in accordance with exemplary embodiments of the present invention. First, link information may be received (Step 401). As discussed above, link information may be information pertaining to the connections made between hosts and domains. This information may be captured, for example, during packet routing or by packet inspection. Next, a bipartite graph may be constructed from the link information (Step 402). As discussed above, in the bipartite graph, hosts and domains are represented by nodes and the links (e.g. data exchanges/connections between hosts and domains) are represented by edges on the graph, where edge weight may be indicative of a level of data transfer or a number of discrete data transfer occasions.

The nodes may then be labeled in accordance with available ground truth data (Step 403). As discussed above, the availability of ground truth data may be limited. The ground truth data may include an indication as to which nodes are known good (i.e. negative) and which nodes are known bad (i.e. positive). In light of the limited availability of this ground truth data, it is to be understood that most nodes may remain unlabeled.

Features may then be extracted from the nodes (Step 404). Consider H hosts and D domains, for hosts, there may be m features (h-1, h-2, . . . h-m), including, for example, the number of bytes, flows, ad packets of traffic, etc. For domains, there may be n features (d-1, d-2, . . . , d-n) extracted, including, for example, lexical features of full URLs, text feature of page content, etc. Assuming that each host is visited by at least one domain and that each domain is visited by at least one host, the label for the i-th host may be denoted as y_(i) ^(h), iε[H] where [H] is defined as the set of {1, 2, . . . , H}.

If host i is benign, y_(i) ^(h)=1, otherwise y_(i) ^(h)−1. Similarly, the j-th domain may be labeled as y_(j) ^(d), jε[D] where [D] is defined as the set of {1, 2, . . . , D}. The links between hosts and domains may be represented by a matrix Mε

^(H×D) Each entry in M may be defined as follows: M_(ij)=1 if the i-th host visits domain j. Otherwise, M_(ij)=0.

Given a small set of labels for l^(h) hosts and l^(d) domains, the features of hosts and domains, as well as the links M, the goal is to automatically learn the labels for the remaining unlabeled hosts and domains. This may be accomplished in steps 405-407, for example, as described below.

Based on the idea of logistic regression classifier, the conditional probabilities of two classes (benign/malicious) may be modeled via a linear function on the features. The feature vectors for hosts and domains may be denoted as h=(1, h-1, . . . , h-m) and d=(1, d-1, . . . , d-n), respectively.

The formulation on the hosts is described in detail below. The formation on the domains may be similarly obtained.

Given the feature vector h-i of the i-th host, its conditional probability being benign has the following form:

$\begin{matrix} {{{{\mathbb{P}}\left\lbrack {y_{i}^{h} = \left. 1 \middle| h_{i} \right.} \right\rbrack} = \frac{e^{\alpha \cdot h_{i}}}{1 + e^{\alpha \cdot h_{i}}}};} & \lbrack 1\rbrack \end{matrix}$

where α is a model parameter for hosts. Here

[y_(i) ^(h)=−1|h_(i)] i.e., 1−

[y_(i) ^(h)=1|h_(i)])nds for the probability of host i being malicious. Similarly, the probability for the j-th domain with feature vector d_(j) being benign is that

${{{\mathbb{P}}\left\lbrack {y_{j}^{d} = \left. 1 \middle| d_{j} \right.} \right\rbrack} = \frac{e^{\beta \cdot d_{j}}}{1 + e^{\beta \cdot d_{j}}}},$

here β is model parameter for domains.

[y_(j) ^(d)=−1|d_(j)] (i.e. 1−

[y_(j) ^(d)=1|d_(j)]) ie probability of the j-th domain being malicious.

Accordingly, the node may be labeled as benign if the conditional probability for a host/domain to be benign is larger than that of being malicious; otherwise it is malicious. Mathematically, the predictive label may be denoted as ŷ_(i) ^(h) and ŷ_(j) ^(d) for the i-th and j-th domain, separately. For example, the predictive label ŷ_(i) ^(h) for the i-th host associated with feature h_(i) may be defined as:

${\hat{y}}_{i}^{h} = \left\{ {\begin{matrix} 1 & {{{{if}\mspace{14mu} {{\mathbb{P}}\left\lbrack {y_{i}^{h} = \left. 1 \middle| h_{i} \right.} \right\rbrack}} \geq {{\mathbb{P}}\left\lbrack {y_{i}^{h} = \left. {- 1} \middle| h_{i} \right.} \right\rbrack}};} \\ {- 1} & {otherwise} \end{matrix}.} \right.$

Plugging in equation [1], ∀iε[H], results in:

${\hat{y}}_{i}^{h} = {\left. {{sgn}\left( {{{\mathbb{P}}\left\lbrack {y_{i}^{h} = \left. 1 \middle| h_{i} \right.} \right\rbrack} - {{\mathbb{P}}\left\lbrack {y_{i}^{h} = \left. {- 1} \middle| h_{i} \right.} \right\rbrack}} \right)}\Leftrightarrow{\hat{y}}_{i}^{h} \right. = {\left. {{sgn}\left( \frac{e^{\alpha \cdot h_{i}} - 1}{e^{\alpha \cdot h_{i}} + 1} \right)}\Leftrightarrow{\hat{y}}_{i}^{h} \right. = {\left. {{sgn}\left( {e^{\alpha \cdot h_{i}} - 1} \right)}\Leftrightarrow{\hat{y}}_{i}^{h} \right. = {{{sgn}\left( {\alpha \cdot h_{i}} \right)}.}}}}$

Here, sgn(•) is sign function and for a real-valued function ƒ: X→

its sign function is defined as sgn (ƒ(x))=1 if ƒ(x)≧0; sgn (ƒ(x))=−1 otherwise.

Moreover, ŷ_(j) ^(d)=sgn(β·d_(j)), ∀jε[D]. Accordingly, the problem of labeling the nodes may be formulated as solving the following optimization problem:

$\begin{matrix} {\min\limits_{\alpha,\beta}\left\{ {{\frac{1}{\left. l^{h} \right|}{\sum\limits_{i = 1}^{l^{h}}{L\left( {y_{i}^{h},{\hat{y}}_{i}^{h}} \right)}}} + {\sum\limits_{j = 1}^{l^{d}}{L\left( {y_{j}^{d},{\hat{y}}_{j}^{d}} \right)}}} \right\}} & \lbrack 2\rbrack \end{matrix}$

where L(•,•) is a loss function. The underlying principal may be described in terms of the optimal model parameters, α* and β* minimizing total misclassification errors between the predicted and true labels over all available samples.

However, as described above, the optimization problem may treat the penalty of all kinds of misclassification types equally, which may be inadequate for the imbalanced class distribution that is most likely to occur (e.g. there will probably be far more negatives than positives). To overcome this challenge, exemplary embodiments of the present invention design a cost matrix for misclassification error (Step 405) in which there is a different cost associated with misclassifying a positive node as negative than misclassifying a negative node as positive. Table 1 below is an example of such a cost matrix:

TABLE 1 Exemplary Cost Matrix True Label +1 True Label −1 Predicted Label +1 0 c Predicted Label −1 a 0

Here, c>a, which is to say, there is a greater penalty for false positive than for false negative. Incorporating this cost matrix into equation [2] yields:

$\begin{matrix} {{\min\limits_{\alpha,\beta}{\frac{1}{l^{h}}{\sum\limits_{i = 1}^{l^{h}}{\left\lbrack {{aL}\left( {y_{i}^{h},{\hat{y}}_{i}^{h}} \right)} \right\rbrack^{\frac{1}{2}{({1 + y_{i}^{h}})}}\left\lbrack {{cL}\left( {y_{i}^{h},{\hat{y}}_{i}^{h}} \right)} \right\rbrack}^{\frac{1}{2}{({1 - y_{i}^{h}})}}}}} + {\frac{1}{l^{d}}{\sum\limits_{j = 1}^{l^{d}}{{\left\lbrack {{aL}\left( {y_{j}^{d},{\hat{y}}_{j}^{d}} \right)} \right\rbrack^{\frac{1}{2}{({1 + y_{j}^{d}})}}\left\lbrack {{cL}\left( {y_{j}^{d},{\hat{y}}_{j}^{d}} \right)} \right\rbrack}^{\frac{1}{2}{({1 - y_{j}^{d}})}}.}}}} & \lbrack 3\rbrack \end{matrix}$

Equation [3] may then be expressed as the following optimization problem:

$\begin{matrix} {{{\min\limits_{\alpha,\beta}{\frac{1}{l^{h}}{\sum\limits_{i = 1}^{l^{h}}\; {\left( \frac{a}{c} \right)^{\frac{y_{i}^{h}}{2}}{L\left( {y_{i}^{h},{\hat{y}}_{i}^{h}} \right)}}}}} + {\frac{1}{l^{d}}{\sum\limits_{j = 1}^{l^{d}}\; {\left( \frac{a}{c} \right)^{\frac{y_{j}^{d}}{2}}{L\left( {y_{j}^{d},{\hat{y}}_{j}^{d}} \right)}}}}},{{{where}\mspace{14mu} {\hat{y}}_{i}^{h}} = {{{{sgn}\left( {\alpha \cdot h_{i}} \right)}\mspace{14mu} {and}\mspace{14mu} {\hat{y}}_{j}^{d}} = {{{sgn}\left( {\beta \cdot d_{j}} \right)}.}}}} & \lbrack 4\rbrack \end{matrix}$

Accordingly, the supervised model may be so built (Step 406). Then, the links may be incorporated into the model to derive hosts' and domains' label predictions at the same time (Step S407). In doing so, it may be assumed that if two nodes of the bipartite graph are connected, there is a higher probability that they share a common label (e.g. the probability may increase proportional to the edge weight of the link). Thus equation [4] may be modified by adding a regularization term to reflect this assumption. For example, Hamming distance may be used as a loss function in this regard. This yields:

$\begin{matrix} {{{\min\limits_{\alpha,\beta}{\frac{1}{l^{h}}{\sum\limits_{i = 1}^{l^{h}}\; {\left( \frac{a}{c} \right)^{\frac{y_{i}^{h}}{2}}{{y_{i}^{h} - {\hat{y}}_{i}^{h}}}}}}} + {\frac{1}{l^{d}}{\sum\limits_{j = 1}^{l^{d}}\; {\left( \frac{a}{c} \right)^{\frac{y_{j}^{d}}{2}}{{y_{j}^{d} - {\hat{y}}_{j}^{d}}}}}} + {\lambda {\sum\limits_{i = 1}^{H}{\sum\limits_{j = 1}^{D}\; {M_{ij}{{{\hat{y}}_{i}^{h} - {\hat{y}}_{j}^{d}}}}}}}},} & \lbrack 5\rbrack \end{matrix}$

where ŷ_(i) ^(h)=sgn(α·h_(i)), ŷ_(j) ^(d)=sgn(β·d_(j)), λ is the regularization parameter.

As Hamming distance is non-differentiable, a continuous loss function may be used to approximate the Hamming distance. The closeness of this approximation may be established by theoretically presenting an upper bound of the distance between the Hamming distance and the continuous loss functions. Further, the CCLR algorithm and convergence analysis may be presented.

For this purpose, the following definition may be observed:

${f\left( {y_{i}^{h},{\hat{y}}_{i}^{h}} \right)} = {\frac{2}{m}{\log \left( {1 + {\exp \left( {- {y_{i}^{h}\left( {\alpha \cdot h_{i}} \right)}} \right)}} \right)}}$

Accordingly, it may be seen that the loss is close to zero when y_(i) ^(h)=sgn(α·h_(i)) and the loss may be larger than zero otherwise. Accordingly, the following equation may be determined:

$\begin{matrix} {{\min\limits_{\alpha,\beta}{\frac{1}{l^{h}}{\sum\limits_{i = 1}^{l^{h}}\underset{\underset{f_{\lambda,a,c}^{h,i}{({\alpha,\beta})}}{}}{\left. {\left( \frac{a}{c} \right)^{\frac{y_{i}^{h}}{2}}\frac{2}{m}{\log \left( {1 + {\exp \left( {- {y_{i}^{h}\left( {\alpha \cdot h_{i}} \right)}} \right)}} \right)}} \right)}}}} + {\frac{1}{l^{d}}{\sum\limits_{j = 1}^{l^{d}}\underset{\underset{f_{\lambda,a,c}^{d,i}{({\alpha,\beta})}}{}}{\left( \frac{a}{c} \right)^{\frac{y_{j}^{d}}{2}}\frac{2}{n}{\log \left( {1 + {\exp \left( {- {y_{j}^{d}\left( {\beta \cdot d_{ij}} \right)}} \right)}} \right)}}}} + {\lambda {\sum\limits_{i = 1}^{H}{\sum\limits_{j = 1}^{D}{\frac{2\; M_{ij}}{mn}\underset{\underset{g^{i,j}{({\alpha,\beta})}}{}}{\log \left( {1 + {\exp \left( {{- \left( {\alpha \cdot h_{i}} \right)}\left( {\beta \cdot h_{j}} \right)} \right)}} \right)}}}}}} & \lbrack 6\rbrack \end{matrix}$

The objective functions may be defined by equations [5] and [6] as F_(λ,a,c)(α,β) and {tilde over (F)}_(λ,a,c)(α,β) respectively. Therefore, in theory, the upper bound of the difference between F_(λ,a,c)(α,β) and {tilde over (F)}_(λ,a,c)(α,β) may be expressed as:

$\begin{matrix} {{{{F_{\lambda,a,c}\left( {\alpha,\beta} \right)} - {{\overset{\sim}{F}}_{\lambda,a,c}\left( {\alpha,\beta} \right)}}} \leq {{\sqrt{\frac{c}{a}}\frac{2}{m}e^{- m}} + {\sqrt{\frac{c}{a}}\frac{2}{n}e^{- n}} + {\lambda \frac{2}{mn}e^{- {mn}}}}} & \lbrack 7\rbrack \end{matrix}$

where m/n is the dimensionality of hosts'/domains' features.

The above proposition is based on the approximation error vanishing, given sufficient dimensions in the hosts' and domains' features. As the objective function is differentiable, the gradients of {tilde over (F)}_(λ,a,c)(α,β) with respect to α and β are easy to obtain:

$\begin{matrix} {{\frac{\partial{{\overset{\sim}{F}}_{\lambda,a,c}\left( {\alpha,\beta} \right)}}{\partial\alpha} = {{\frac{1}{l^{h}}{\sum\limits_{i = 1}^{l^{h}}{\left( \frac{a}{c} \right)^{\frac{y_{i}^{Il}}{2}}\frac{2}{m}\frac{{- y_{i}^{h}}h_{i}}{1 + {\exp \left( {y_{i}^{h}\left( {\alpha \cdot h_{i}} \right)} \right)}}}}} + {\lambda {\sum\limits_{i = 1}^{H}{\sum\limits_{j = 1}^{D}{M_{ij}\frac{2}{mn}\frac{{- \left( {\beta \cdot d_{j}} \right)} \cdot h_{i}}{1 + {\exp\left( {\left( {\alpha \cdot h_{i}} \right)\left( {\beta \cdot d_{j}} \right)} \right.}}}}}}}};{\frac{\partial{{\overset{\sim}{F}}_{\lambda,a,c}\left( {\alpha,\beta} \right)}}{\partial\alpha} = {{\frac{1}{l^{d}}{\sum\limits_{j = 1}^{l^{d}}{\left( \frac{a}{c} \right)^{\frac{y_{j}^{d}}{2}}\frac{2}{n}\frac{{- y_{j}^{d}}d_{j}}{1 + {\exp \left( {y_{j}^{d}\left( {\beta \cdot d_{j}} \right)} \right)}}}}} + {\lambda {\sum\limits_{i = 1}^{H}{\sum\limits_{j = 1}^{D}{M_{ij}\frac{2}{mn}{\frac{{- \left( {\alpha \cdot h_{i}} \right)} \cdot d_{j}}{1 + {\exp\left( {\left( {\alpha \cdot h_{i}} \right)\left( {\beta \cdot d_{j}} \right)} \right.}}.}}}}}}}} & \lbrack 8\rbrack \end{matrix}$

To obtain the parameter estimates, a Stochastic Gradient Descent (SGD) technique may be applied. The idea here may be to begin with some random guess of α⁰ and β⁰ and then based on equation [8], one element of α and β may be randomly updated until the convergence criterion is satisfied. An example of such an algorithm is summarized below:

Algorithm 1 CCLR via the SGD Technique   Input: {y_(i) ^(h)}_(i=1) ^(l) ^(h) , {h_(i)}_(i=1) ^(H), {y_(j) ^(d)}_(j=1) ^(l) ^(d) , {d_(j)}_(j=1) ^(D), M ∈ {0, 1}^(H×D), λ, and {η_(t)}_(t≧1). 1: Initialize α⁰ and β⁰; 2: while convergence criterion is not satisfied do 3:  Randomly choose a pair (i, j) from [m] × [n]; 4:  α^(t+1) ← α^(t), β^(t+1) ← β^(t); 5:   $\left. {\alpha^{t + 1}(i)}\leftarrow{{\alpha^{t}(i)} - {\eta_{t}\frac{\partial{{\overset{\sim}{F}}_{\lambda,a,c}\left( {\alpha^{t},\beta^{t}} \right)}}{\partial\alpha^{t}}(i)}} \right.;$ 6:   $\left. {\beta^{t + 1}(j)}\leftarrow{{\beta^{t}(j)} - {\eta_{t}\frac{\partial{{\overset{\sim}{F}}_{\lambda,a,c}\left( {\alpha^{t},\beta^{t}} \right)}}{\partial\beta^{t}}(j)}} \right.;$ 7:  Normalize α^(t+1) and β^(t+1); 8: end while Output: {circumflex over (α)} = α^(T) and {circumflex over (β)} = β^(T)

The convergence of this algorithm may be analyzed. As

$\mspace{211mu} {\frac{\partial{\overset{\sim}{F}}_{\lambda,a,c}}{\partial\alpha}=={{\frac{1}{l^{h}}\text{?}{\sum\limits_{i}\; \frac{\partial f_{\lambda,a,c}^{i}}{\partial\alpha}}} + {\lambda {\sum\limits_{ij}{M_{ij}\frac{\partial g^{i,j}}{\partial\alpha}\text{?}}}}}}$ ?indicates text missing or illegible when filed

may be determined that:

$\begin{matrix} {\frac{\partial^{2}f_{\lambda,a,c}^{i}}{\partial\alpha^{2}} = {{\left( \frac{a}{c} \right)^{\frac{y_{i}^{h}}{2}}\frac{2}{m}\frac{\left( {y_{i}^{h}h_{i}} \right)^{T}\left( {y_{i}^{h}h_{i}} \right){\exp \left( {y_{i}^{h}\left( {\alpha \cdot h_{i}} \right)} \right)}}{\left( {1 + {\exp \left( {y_{i}^{h}\left( {\alpha \cdot h_{i}} \right)} \right)}} \right)^{2}}} + {\lambda \frac{2\; M_{ij}}{mn}{\frac{\left( {\left( {\beta \cdot d_{j}} \right)^{2}\left( h_{i} \right)^{T}\left( h_{i} \right){\exp \left( {\left( {\beta \cdot d_{j}} \right)\left( {\alpha \cdot h_{i}} \right)} \right)}} \right.}{\left( {1 + {\exp \left( {\left( {\beta \cdot d_{j}} \right)\left( {\alpha \cdot h_{i}} \right)} \right)}} \right)^{2}}.}}}} & \lbrack 9\rbrack \end{matrix}$

Assuming the features are normalized (normalization may be conducted in the preprocessing step), h_(i) ^(T)·h_(i)=1 yields that:

$\begin{matrix} {{{\frac{\partial f_{\lambda,a,c}^{i}}{\partial\alpha}{{\alpha - \frac{\partial f_{\lambda,a,c}^{i}}{\partial\alpha}}}\alpha^{\prime}}} \leq {{\frac{\partial^{2}f_{\lambda,a,c}^{i}}{\partial\alpha^{2}}}{{\alpha - \alpha^{\prime}}}} \leq {\frac{2}{m}\left( {\sqrt{\frac{a}{c}} + \frac{\lambda}{n}} \right){{{\alpha - \alpha^{\prime}}}.}}} & \lbrack 10\rbrack \end{matrix}$

This indicates that

$\frac{\partial f_{\lambda,a,c}^{i}}{\partial\alpha}\mspace{14mu} {is}\mspace{14mu} \frac{2}{m}\left( {\sqrt{\frac{a}{c}} + \frac{\lambda}{n}} \right)\text{:}$

Lipschitz continuity (A function ƒ: X→Y is called λ-Lipschitz continuity, if for all x₁ and x₂, in X, d_(Y)(ƒ(x₁), ƒ(x₂))≦λd_(X)(x₁, x₂) holds).

As

${\frac{\partial^{2}f_{\lambda,a,c}^{i}}{\partial\alpha^{2}} > 0}\mspace{14mu}$

implying that

${\frac{\partial^{2}f_{\lambda,a,c}^{i}}{\partial\alpha^{2}} = \mspace{11mu} {{\sum_{i}\frac{\partial^{2}f_{\lambda,a,c}^{i}}{\partial\alpha^{2}}} > 0}},$

{tilde over (F)}_(λ,a,c)(α,β) may be a strongly convex function. Accordingly, with a constant step size of

${\eta_{t} = \frac{1}{2\; {nL}}},$

where

${L = \mspace{11mu} {\frac{2}{m}\left( {\sqrt{\frac{a}{c}} + \frac{\lambda}{n}} \right)}},$

the α^(t) and β^(t) obtained at the t-th iteration of CCLR may satisfy:

$\begin{matrix} {{\left\lbrack {{\alpha^{t} - \alpha^{*}}}^{2} \right\rbrack} \leq {{\left( {1 - \frac{\mu}{16\left( {\sqrt{\frac{a}{c}} + \frac{\lambda}{n}} \right)}} \right)^{t}\left\lbrack {{3{{\alpha_{0} - \alpha^{*}}}^{2}} + \frac{9\sigma^{2}}{4\left( {\frac{2}{m}\left( {\sqrt{\frac{a}{c}} + \frac{\lambda}{n}} \right)} \right)^{2}}} \right\rbrack}.\text{}{\left\lbrack {{\beta^{t} - \beta^{*}}}^{2} \right\rbrack}} \leq {{\left( {1 - \frac{\mu}{16\left( {\sqrt{\frac{a}{c}} + \frac{\lambda}{m}} \right)}} \right)^{t}\left\lbrack {{3{{\beta_{0} - \beta^{*}}}^{2}} + \frac{9\sigma^{2}}{4\left( {\frac{2}{n}\left( {\sqrt{\frac{a}{c}} + \frac{\lambda}{m}} \right)} \right)^{2}}} \right\rbrack}.}} & \lbrack 11\rbrack \end{matrix}$

The above proposition states that as the iteration step increases, the model parameters are closer to the true parameters α* and β*. This may ensure the performance of the CCLR described above.

Thus according to the above, the supervised models that were built in Step 406 are then used to label all unknown nodes of the bipartite graph (Step 407). It may then be determined whether one or more of the previously unknown nodes have been labeled as positive/malicious (Step 408). If this is the case (Yes, Step 408) then an alert may be generated (Step 409). The alert may be a signal to a network administrator, for example, in the form of an email, text message or the like, that an anomaly has been detected in a host or domain. The network administrator may thereafter investigate the anomaly and take remedial action, as necessary.

However, according to some exemplary embodiments of the present invention, if it is determined that a confidence score associated with the positive label is of a sufficient magnitude (e.g., a confidence score exceeds a predetermined threshold) (Yes, Step 410), then in addition to the generation of the alert at Step 409, the network apparatus 200 (e.g. router or firewall) may be directed to automatically block or discontinue packet transmission to and/or from the anomalous host/domain (Step 411). In this way, security of the greater computer network and/or other domains, may be enhanced.

FIG. 5 shows an example of a computer system which may implement a method and system of the present disclosure. The system and method of the present disclosure may be implemented in the form of a software application running on a computer system, for example, a mainframe, personal computer (PC), handheld computer, server, etc. The software application may be stored on a recording media locally accessible by the computer system and accessible via a hard wired or wireless connection to a network, for example, a local area network, or the Internet.

The computer system referred to generally as system 1000 may include, for example, a central processing unit (CPU) 1001, random access memory (RAM) 1004, a printer interface 1010, a display unit 1011, a local area network (LAN) data transmission controller 1005, a LAN interface 1006, a network controller 1003, an internal bus 1002, and one or more input devices 1009, for example, a keyboard, mouse etc. As shown, the system 1000 may be connected to a data storage device, for example, a hard disk, 1008 via a link 1007.

As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.

Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).

Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.

The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.

The flowcharts and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

Exemplary embodiments described herein are illustrative, and many variations can be introduced without departing from the spirit of the disclosure or from the scope of the appended claims. For example, elements and/or features of different exemplary embodiments may be combined with each other and/or substituted for each other within the scope of this disclosure and appended claims. 

What is claimed is:
 1. A network security apparatus, comprising: a packet detector detecting transmission of data packets between a plurality of hosts and a plurality of domains and defining a plurality of links therefrom; a model builder circuit receiving the plurality of links from the packet detector, receiving ground truth information labeling one or more of the plurality of hosts or one or more of the plurality of domains as benign or malicious, generating predictive models from the received links and ground truth information, and storing the generated predictive models in a predictive model database; and an anomaly detector circuit retrieving the generated predictive models from the predictive model database and using the predictive models to label each of the plurality of hosts and plurality of domains, that have not previously been labeled by the ground truth information, as benign or malicious.
 2. The network security apparatus of claim 1, wherein the network security apparatus is a packet router.
 3. The network security apparatus of claim 1, wherein the network security apparatus is a firewall.
 4. The network security apparatus of claim 1, wherein the predictive model is generated, by the model builder circuit, by constructing a bipartite graph in which each of the plurality of hosts are represented as nodes on one side of the graph, each of the plurality of domains are represented as nodes on an opposite side of the graph, and each of the plurality of links are represented as edges connecting nodes on opposite sides of the graph.
 5. The network security apparatus of claim 4, wherein an edge weight of each of the edges is determined by either a number of links between a given host and a given domain or an amount of data transferred between the given host and the given domain.
 6. The network security apparatus of claim 5, wherein the predictive model is generated, by the model builder circuit, by extracting features from each of the nodes of the graph and determining which of the extracted features are highly correlated to positive labels.
 7. The network security apparatus of claim 6, wherein a node that is linked to a node with a positive label has an increased probability of being positively labeled.
 8. The network security apparatus of claim 1, wherein the packet detector is a router that forwards packets between the plurality of hoists and the plurality of domains.
 9. The network security apparatus of claim 8, wherein when the anomaly detector circuit labels one of the plurality of hosts or plurality of domains, that have not previously been labeled by the ground truth information, as malicious, the router blocks traffic to and from the malicious-labeled host or domain.
 10. A method for detecting malicious behavior in a computer network, comprising: receiving packet transmission information including a plurality of data links between a plurality of hosts and a plurality of domains; constructing a bipartite graph in which each of the plurality of hosts are represented as nodes on one side of the graph, each of the plurality of domains are represented as nodes on an opposite side of the graph, and each of the plurality of links are represented as edges connecting nodes on opposite sides of the graph; labeling one or more of the nodes of the bipartite graph as benign or malicious according to ground truth information; defining a cost matrix for misclassification penalty in which a misclassification penalty for labeling a benign node as malicious is less than a misclassification penalty for labeling a malicious node as benign; constructing supervised models or classifiers based on the nodes of the bipartite graph labeled according to ground truth information, the plurality of links, and the designed cost matrix; and labeling each of the plurality of hosts and each of the plurality of domains, that have not previously been labeled by the ground truth information, as benign or malicious according to the constructed supervised models or classifiers.
 11. The method of claim 10, wherein at least a first of the constructed supervised models or classifiers is responsible for labeling nodes and at least a second of the constructed supervised models or classifiers is responsible for labeling domains.
 12. The method of claim 10, wherein an edge weight of each of the edges is determined by either a number of links between a given host and a given domain or an amount of data transferred between the given host and the given domain.
 13. The method of claim 10, wherein the supervised models or classifiers are constructed by extracting features from each of the nodes of the graph and determining which of the extracted features are highly correlated to malicious labels.
 14. The method of claim 10, wherein when one of the plurality of hosts or plurality of domains, that have not previously been labeled by the ground truth information, is labeled as malicious, according to the constructed supervised models or classifiers, an alert is transmitted to a network administrator.
 15. The method of claim 10, wherein when one of the plurality of hosts or plurality of domains, that have not previously been labeled by the ground truth information, is labeled as malicious, according to the constructed supervised models or classifiers, traffic to and from the malicious-labeled host or domain is blocked.
 16. A method for detecting malicious behavior in a computer network, comprising: receiving packet transmission information including a plurality of data links between a plurality of hosts and a plurality of domains; constructing a bipartite graph in which each of the plurality of hosts are represented as nodes on one side of the graph, each of the plurality of domains are represented as nodes on an opposite side of the graph, and each of the plurality of links are represented as edges connecting nodes on opposite sides of the graph; labeling one or more of the nodes of the bipartite graph as benign or malicious according to ground truth information; and propagating the labeling of the one or more nodes of the bipartite graph that have been labeled as benign or malicious along the plurality of links.
 17. The method of claim 16, wherein propagating the labeling of the one or more nodes of the bipartite graph that have been labeled as benign or malicious along the plurality of links includes constructing supervised models or classifiers based on the nodes of the bipartite graph labeled according to ground truth information and the plurality of links, wherein a node that is linked to a node with a positive label has an increased probability of being positively labeled.
 18. The method of claim 17, wherein constructing supervised models or classifiers further includes designing a cost matrix for misclassification penalty in which a misclassification penalty for labeling a benign node as malicious is less than a misclassification penalty for labeling a malicious node as benign.
 19. The method of claim 17, wherein the supervised models or classifiers are constructed by extracting features from each of the nodes of the graph and determining which of the extracted features are highly correlated to malicious labels.
 20. The method of claim 16, wherein when a malicious label is propagated, an alert is generated. 